The Block Diagonal Infinite Hidden Markov Model
نویسندگان
چکیده
The Infinite Hidden Markov Model (IHMM) extends hidden Markov models to have a countably infinite number of hidden states (Beal et al., 2002; Teh et al., 2006). We present a generalization of this framework that introduces nearly block-diagonal structure in the transitions between the hidden states, where blocks correspond to “subbehaviors” exhibited by data sequences. In identifying such structure, the model classifies, or partitions, sequence data according to these sub-behaviors in an unsupervised way. We present an application of this model to artificial data, a video gesture classification task, and a musical theme labeling task, and show that components of the model can also be applied to graph segmentation.
منابع مشابه
Fast Likelihood Computation Method Using Block-diagonal Covariance Matrices in Hidden Markov Model
The paper presented a novel method to speed up the likelihood computation of the speech recognition system based continuous Hidden Markov Model (CHMM). The block-diagonal covariance matrices were applied in the method and the technique to construct an optimal block-diagonal matrix was introduced. The experimental results demonstrated that the block-diagonal covariance matrices could achieve a l...
متن کاملOn Hidden Markov Processes with Infinite Excess Entropy
We investigate stationary hidden Markov processes for which mutual information between the past and the future is infinite. It is assumed that the number of observable states is finite and the number of hidden states is countably infinite. Under this assumption, we show that the block mutual information of a hidden Markov process is upper bounded by a power law determined by the tail index of t...
متن کاملA flexible method of creating HMM using block-diagonalization of covariance matrices
A new algorithm to reduce the amount of calculation in the likelihood computation of continuous mixture HMM(CMHMM) with block-diagonal covariance matrices while retaining high recognition rate is proposed. The block matrices are optimized by minimizing di erence between the output probability calculated with full covariance matrices and that calculated with block-diagonal covariance matrices. T...
متن کاملSemi-tied Full-covariance Matrices for Hidden Markov Models
There is normally a simple choice made in the form of the covariance matrix to be used with HMMs. Either a diagonal covariance matrix is used, with the underlying assumption that elements of the feature vector are independent, or a full or block-diagonal matrix is used, where all or some of the correlations are explicitly modelled. Unfortunately when using full or block-diagonal covariance matr...
متن کاملBlock SOR for Kronecker structured representations
The Kronecker structure of a hierarchical Markovian model (HMM) induces nested block partitionings in the transition matrix of its underlying Markov chain. This paper shows how sparse real Schur factors of certain diagonal blocks of a given partitioning induced by the Kronecker structure can be constructed from smaller component matrices and their real Schur factors. Furthermore, it shows how t...
متن کامل